package com.leetcode.根据数据结构分类.数组;

/**
 * @author: xiaomi
 * @date: 2021/4/8
 * @description: 153. 寻找旋转排序数组中的最小值
 * https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
 */
public class B_153_寻找旋转排序数组中的最小值 {
    static B_153_寻找旋转排序数组中的最小值 action = new B_153_寻找旋转排序数组中的最小值();

    public static void main(String[] args) {
        test1();
        test2();
        test3();
    }

    static void test1() {
        //

        //System.out.println("res = " + res);
    }

    static void test2() {
        //

        //System.out.println("res = " + res);
    }

    static void test3() {
        //

        //System.out.println("res = " + res);
    }

    public int findMin(int[] nums) {
        int min = nums[0];
        int len = nums.length;
        for (int i = 1; i < len; i++) {
            min = Math.min(min, nums[i]);
        }
        return min;
    }
}
